285C - Building Permutation - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
#define vi vector<int>
#define vl vector<long long>
#define vpi vector<pair<int,int>>
#define vpl vector<pair<<long long,long long>>
#define si set<int>
#define sl set<long long>
#define usi unordered_set<int>
#define usl unordered_set<long long>
#define mi map<int,int>
#define ml map<long long,long long>
#define umi unordered_map<int,int>
#define uml unordered_map<long long,long long>
#define pb push_back
#define fr first
#define sc second
#define M int(1e9+7)
#define Y cout<<"YES\n"
#define N cout<<"NO\n"
#define NP cout<<"-1\n"
#define all(x) (x).begin(), (x).end()
#define R return
#define anand_patel ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define loop_in(i,x,a) for(int i=x;i<a;i++)
#define loop_dec(i,x,a) for(int i=x;i>=a;i--)


/**********************************************************************************/

void __print(int x) {cout << x;}
void __print(long x) {cout << x;}
void __print(long long x) {cout << x;}
void __print(unsigned x) {cout << x;}
void __print(unsigned long x) {cout << x;}
void __print(unsigned long long x) {cout << x;}
void __print(float x) {cout << x;}
void __print(double x) {cout << x;}
void __print(long double x) {cout << x;}
void __print(char x) {cout << '\'' << x << '\'';}
void __print(const char *x) {cout << '\"' << x << '\"';}
void __print(const string &x) {cout << '\"' << x << '\"';}
void __print(bool x) {cout << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cout << '{'; for (auto &i: x) cout << (f++ ? "," : ""), __print(i); cout << "}";}
void _print() {cout << "]"<<endl;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cout << ", "; _print(v...);}
#define deb(x...) cout << #x << " = ["; _print(x)

/***************************************************************************************************************************************/

void solve(){
    int n;
    cin>>n;
    vi v(n);
    loop_in(i,0,n) cin>>v[i];
    sort(all(v));
    ll ans=0;
    loop_in(i,0,n){
        ans+=abs(v[i]-(i+1));
    }
    cout<<ans<<endl;
}

int main()
{
    anand_patel;
    int t=1;
    // cin>>t;
    while(t--){
        // cout<<t<<endl;
        solve();
    }
    return 0;
}